Moving Bins from Conveyor Belts onto Pallets Using FIFO Queues
نویسندگان
چکیده
We study the combinatorial FIFO stack-up problem. In delivery industry, bins have to be stacked-up from conveyor belts onto pallets. Given k sequences q1, . . . ,qk of labeled bins and a positive integer p, the goal is to stack-up the bins by iteratively removing the first bin of one of the k sequences and put it onto a pallet located at one of p stack-up places. Each of these pallets has to contain bins of only one label, bins of different labels have to be placed on different pallets. After all bins of one label have been removed from the given sequences, the corresponding place becomes available for a pallet of bins of another label. The FIFO stack-up problem is NP-complete in general. In this paper we show that the problem can be solved in polynomial time, if the number k of given sequences is fixed.
منابع مشابه
A Practical Approach for the FIFO Stack-Up Problem
We consider the FIFO Stack-Up problem which arises in delivery industry, where bins have to be stacked-up from conveyor belts onto pallets. Given k sequences q1, . . . , qk of labeled bins and a positive integer p. The goal is to stack-up the bins by iteratively removing the first bin of one of the k sequences and put it onto a pallet located at one of p stack-up places. Each of these pallets h...
متن کاملInteger Programming Models and Parameterized Algorithms for Controlling Palletizers
We study the combinatorial FIFO Stack-Up problem, where bins have to be stacked-up from conveyor belts onto pallets. This is done by palletizers or palletizing robots. Given k sequences of labeled bins and a positive integer p, the goal is to stack-up the bins by iteratively removing the first bin of one of the k sequences and put it onto a pallet located at one of p stack-up places. Each of th...
متن کاملComplexity of the FIFO Stack-Up Problem
We study the combinatorial FIFO stack-up problem. In delivery industry, bins have to be stacked-up from conveyor belts onto pallets with respect to customer orders. Given k sequences q1, . . . , qk of labeled bins and a positive integer p, the aim is to stack-up the bins by iteratively removing the first bin of one of the k sequences and put it onto an initially empty pallet of unbounded capaci...
متن کاملAn approximation algorithm for the stack-up problem
We consider the combinatorial stack-up problem motivated by stacking up bins from a conveyor onto pallets. The stack-up problem is to decide whether a given list q of labeled objects can be processed by removing step by step one of the ®rst s objects of q so that the following holds. After each removal there are at most p labels for which the ®rst object is already removed from q and the last o...
متن کاملAlgorithms for Controlling Palletizers
Palletizers are widely used in delivery industry. We consider a large palletizer where each stacker crane grabs a bin from one of k conveyors and position it onto a pallet located at one of p stack-up places. All bins have the same size. Each pallet is destined for one customer. A completely stacked pallet will be removed automatically and a new empty pallet is placed at the palletizer. The FIF...
متن کامل